Creating Small Subgraphs in Achlioptas Processes With Growing Parameter
نویسندگان
چکیده
We study the problem of creating a copy of some fixed graph H in the Achlioptas process on n vertices with parameter r, where r = r(n) is a growing function of n. We prove general upper and lower bounds on the threshold of this problem, and derive exact threshold functions for the case where H is a tree, a cycle, or the complete graph on four vertices.
منابع مشابه
Avoiding small subgraphs in Achlioptas processes
For a fixed integer r, consider the following random process. At each round, one is presentedwith r random edges from the edge set of the complete graph on n vertices, and is asked to chooseone of them. The selected edges are collected into a graph, which thus grows at the rate of oneedge per round. This is a natural generalization of what is known in the literature as an Achlio...
متن کاملExplosive percolation: a numerical analysis.
Percolation is one of the most studied processes in statistical physics. A recent paper by Achlioptas [Science 323, 1453 (2009)] showed that the percolation transition, which is usually continuous, becomes discontinuous ("explosive") if links are added to the system according to special cooperative rules (Achlioptas processes). In this paper, we present a detailed numerical analysis of Achliopt...
متن کاملSatisfiability and the Giant Component in Online Variants of the Classical Random Models
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v Chapter 1 THE ACHLIOPTAS PROCESSES . . . . . . . . . . . . . . . . . . . 1 1.1 Size Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Our Main Result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3 Lower Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2 RANDOM ...
متن کاملRandom k-SAT and the Power of Two Choices
We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well-studied area of probabilistic combinatorics (Achlioptas processes) to random CSP’s....
متن کاملA new upper bound for Achlioptas processes
We consider here on-line algorithms for Achlioptas processes. Given a initially empty graph G on n vertices, a random process that at each step selects independently and uniformly at random two edges from the set of non-edges is launched. We must choose one of the two edges and add it to the graph while discarding the other. The goal is to avoid the appearance of a connected component spanning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 26 شماره
صفحات -
تاریخ انتشار 2012